Average Complexity Analysis of Scalar Quantizer design
نویسندگان
چکیده
In this paper an exact and complete analysis of average design complexities of Lloyd-Max's scalar quantizers, scalar compandors and scalar quantizers designed using the hybrid model is carried out. The average design complexity depends on arithmetic complexity, memory complexity and implementation complexity. It is demonstrated that for a fixed number of quantizaton levels N, scalar compandors have the smallest and the Lloyd-Max's scalar quantizers have the largest complexity. Furthermore, it is shown that for a fixed number of quantizaton levels N the average design complexity of hybrid scalar quantizers is significantly smaller than the average design complexity of Lloyd-Max's scalar quantizers. Combining this result with the fact that the performances of hybrid scalar quantizers are almost equal to the optimal performances of LloydMax's scalar quantizers, the usability of recently developed hybrid model is confirmed.
منابع مشابه
Mapping of Pruned Tree-Structured Scalar Quantizers to Companding: A Design Strategy
Pruned tree-structured scalar quantizers are a form of non-uniform scalar quantizer that are named due to being designed via pruning a tree-structured scalar quantizer [1]. If designed via pruning a uniform tree-structured scalar quantizer, such a quantizer may be mapped to a piecewise linear compandor. An algorithm has been developed for mapping a piecewise linear compandor onto a a tree-struc...
متن کاملApproximating vector quantisation by transformation and scalar quantisation
Vector quantization provides better ratedistortion performance over scalar quantization even for a random vector with independent dimensions. However, the design and implementation complexity of vector quantizers is much higher than that of scalar quantizers. To reduce the complexity while achieving performance close to optimal vector quantization and better than scalar quantization, we propose...
متن کاملQuantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System
We propose a polynomial-time algorithm for optimal scalar quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained scalar quantizers, multi-resolution scalar quantizers, multiple description scalar quantizers, and Wyner-Ziv scalar quantizers. The algorithm guarantees globally optimal solutions fo...
متن کاملOptimal designing scalar quantizers using a hybrid quantization method for the Laplacian source
This paper proposes new method for designing scalar quantizers. The proposed method, denoted as hybrid method, combines two quantization techniques, the companding technique and the Lloyd-Max's algorithm. In this paper an exact and complete analysis of the hybrid quantization method considering the Laplacian input signals is carried out. Furthermore, two approaches to the problem of finding the...
متن کاملDesign of multiple description scalar quantizers
AbsPuct-The design of scalar quantizers for communication systems that use diversity to overcome channel impairments is considered. The design problem is posed as an optimization problem and necessary conditions for optimality are derived. A design algorithm, a generalization of Lloyd’s algorithm for quantizer design, is developed. Unlike a single channel scalar quantizer, the performance of a ...
متن کامل